Answering Imprecise Queries over Autonomous Databases
نویسندگان
چکیده
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest metrics that are hard to elicit from lay users. Moreover they assume the ability to modify the architecture of the underlying database. Given that most Web databases are autonomous and may have users with limited expertise over the associated domains, current approaches for answering imprecise queries are not applicable to autonomous databases such as those accessible on the Web. This dissertation presents AIMQ a domain independent framework for supporting imprecise queries over autonomous databases with minimal input from users and no modifications to the underlying database. AIMQ provides answers satisfying an imprecise query by identifying and executing a set of precise queries similar to the imprecise query. AIMQ begins by mapping the given imprecise query to a precise query with non-null resultset. Then using a approximate functional dependency (AFD) based query relaxation heuristic AIMQ identifies a set of precise queries similar to the initially mapped precise query. AIMQ measures the similarity between a tuple and the imprecise query as the weighted summation of similarity over attributes. However, measuring similarity requires distance metrics to be provided by the users or an expert; often quite difficult even for experts. Hence, a context-sensitive domain-independent semantic similarity estimation technique has also been developed as part of AIMQ. Results of empirical evaluation conducted using multiple real-life databases demonstrate both the domain independence and the efficiency of AIMQ’s learning
منابع مشابه
Supporting Queries with Imprecise Constraints
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ a domain independent approach for answering imprecise queries that automatically learns query relaxation order by using approximate functional dependencies. We also describe our approach for learning similarity between values of categoric...
متن کاملSupporting Imprecision in Database Systems
A query against incomplete or imprecise data in a database1, or a query whose search conditions are imprecise can both result in answers that do not satisfy the query completely. Such queries can be broadly termed as imprecise queries. Today’s database systems are designed largely for precise queries against a database of precise and complete data. Range queries (e.g., Age BETWEEN 20 AND 30) an...
متن کاملAnswering Imprecise Queries over Web Databases
The rapid expansion of the World Wide Web has made a large number of databases like bibliographies, scientific databases etc. to become accessible to lay users demanding “instant gratification”. Often, these users may not know how to precisely express their needs and may formulate queries that lead to unsatisfactory results. For example, suppose a user wishes to search for sedans priced around ...
متن کاملThere Is No Dichotomy Between Effectiveness and Efficiency in Keyword Search Over Databases
Ordinary users, such as scientists, are not familiar with the concepts of schema and query language and rely on query interfaces that can handle keyword queries or natural language [1]. Moreover, users who know query languages such as SQL, do not often know the content and/or structure of the data sufficiently well to precisely specify their queries. As imprecise queries do not exactly reflect ...
متن کاملOn the finite controllability of conjunctive query answering in databases under open-world assumption
In this paper we study queries over relational databases with integrity constraints (ICs). The main problem we analyze is OWA query answering, i.e., query answering over a database with ICs under open-world assumption. The kinds of ICs that we consider are inclusion dependencies and functional dependencies, in particular key dependencies; the query languages we consider are conjunctive queries ...
متن کامل